Dynamic Tree Shortcut with Constant Degree
نویسندگان
چکیده
Given a rooted tree with n nodes, the tree shortcut problem is to add a set of shortcut edges to the tree such that the shortest path from each node to any of its ancestors is of length O(logn) and the degree increment of each node is constant. We consider in this paper the dynamic version of the problem, which supports node insertion and deletion. For insertion, a node can be inserted as a leaf node or an internal node by sub-dividing an existing edge. For deletion, a leaf node can be deleted, or an internal node can be merged with its single child. We propose an algorithm that maintains a set of shortcut edges in O(logn) time for an insertion or deletion.
منابع مشابه
Prediction of the Operating Conditions in a Batch Distillation Column Using a Shortcut Method
A shortcut procedure as quick, easy-to use method for design and simulation of multicomponent batch distillation is used to predict the operating condition of recovering xylene from solvent in an existing batch distillation column in benzol refinery. The procedure can be used to investigate the effect of the operating parameters on the operation of column for three possible modes of batch d...
متن کاملMinimizing the Continuous Diameter When Augmenting a Tree with a Shortcut
We augment a tree T with a shortcut pq to minimize the largest distance between any two points along the resulting augmented tree T + pq. We study this problem in a continuous and geometric setting where T is a geometric tree in the Euclidean plane, where a shortcut is a line segment connecting any two points along the edges of T , and we consider all points on T + pq (i.e., vertices and points...
متن کاملOptimal Shortcuts for Balanced Search Trees - A Technical Report
We present an alternative to tree rebalancing for improving the expected search cost in weighted binary search trees. This alternative is based on the insertion of shortcut links between nodes in the search tree. We propose several shortcut models and give polynomial time algorithms to find the best shortcuts for two of these models.
متن کاملA Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree
We consider the problem of finding a shortcut connecting two vertices of a graph that minimizes the diameter of the resulting graph. We present an O(n2 log3 n)-time algorithm using linear space for the case that the input graph is a tree consisting of n vertices. Additionally, we present an O(n2 log3 n)-time algorithm using linear space for a continuous version of this problem. 1998 ACM Subject...
متن کاملMinimizing the Diameter of a Network Using Shortcut Edges
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor approximation algorithms for different variations of this problem. We also show how to improve the approximation ratios using resource augmentation to allow more than k shortcut edges. We observe a close relation between t...
متن کامل